Conceptual level concurrency control of relational update transactions
نویسندگان
چکیده
منابع مشابه
Unifying concurrency control and recovery of transactions
Transaction management in shared databases is generally viewed as a combination of two problems, concurrency control and recovery, which have been considered as orthogonal problems. Consequently, the correctness criteria derived for these problems are incomparable. Recently a uniied theory of concurrency control and recovery has been introduced that is based on com-mutativity and performs trans...
متن کاملA Concurrency Control Scheme for Nested Transactions
Locking rules for concurrency control in nested transaction model, in which parent/child parallelism, sibling parallelism, and arbitrary commitment-dependence relationship between transactions are allowed, are presented. The locking rules are based on the lock transformation scheme that never allows the commit deadlock to occur, which could happen by permitting parent/child parallelism. In addi...
متن کاملConcurrency control for step-decomposed transactions
A number of authors have proposed methods for increasing the throughput of transaction processing systems by decomposing transactions into steps and allowing the steps of concurrently executing transactions to be interleaved. In some proposals all interleavings are assumed to be acceptable, while in others certain interleavings are forbidden. In this paper we describe a new concurrency control ...
متن کاملA concurrency control protocol for nested transactions
Nested transactions[6, 5] provide fine grain atomicity, efficient recovery control, and structural modularity. In distributed environments, they provide a natural and semantically clean way of modelin g computations . However, the characteristics of nested transactions are sufficiently different from those o f traditional single-level transactions that concurrency control for nested transaction...
متن کاملThe Concurrency Control and Recovery Problem for Multilevel Update Transactions in MLS System
This paper addresses the problem of a transaction reading and writing data at multiple classification levels in a Multilevel Secure (MLS) database. We refer to such transactions as multilevel update transactions. We show that no scheduler can ensure atomicity of multilevel update transactions in the presence of transaction aborts and at the same time be secure. There are essentially two ways of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90065-n